A recurrent neural network with ever changing synapses
نویسندگان
چکیده
منابع مشابه
A recurrent neural network with ever changing synapses
A recurrent neural network with noisy input is studied analytically, on the basis of a Discrete Time Master Equation. The latter is derived from a biologically realizable learning rule for the weights of the connections. In a numerical study it is found that the fixed points of the dynamics of the net are time dependent, implying that the representation in the brain of a fixed piece of informat...
متن کاملA Recurrent Neural Network Model for Solving Linear Semidefinite Programming
In this paper we solve a wide rang of Semidefinite Programming (SDP) Problem by using Recurrent Neural Networks (RNNs). SDP is an important numerical tool for analysis and synthesis in systems and control theory. First we reformulate the problem to a linear programming problem, second we reformulate it to a first order system of ordinary differential equations. Then a recurrent neural network...
متن کاملCCG Supertagging with a Recurrent Neural Network
Recent work on supertagging using a feedforward neural network achieved significant improvements for CCG supertagging and parsing (Lewis and Steedman, 2014). However, their architecture is limited to considering local contexts and does not naturally model sequences of arbitrary length. In this paper, we show how directly capturing sequence information using a recurrent neural network leads to f...
متن کاملStochastic learning in a neural network with adapting synapses
We consider a neural network with adapting synapses whose dynamics can be analitically computed. The model is made of N neurons and each of them is connected to K input neurons chosen at random in the network. The synapses are n-states variables which evolve in time according to Stochastic Learning rules; a parallel stochastic dynamics is assumed for neurons. Since the network maintains the sam...
متن کاملEver Changing “stars” – Network Experiments in Continuous Time–
Inspired by the 2-way-information flow model on network formation by Bala and Goyal (2000) and strategy adaptation experiments of players in (almost) continuous time (e.g., Berninghaus, Ehrhart and Keser 1999) we design network formation experiments in which almost all groups not only reach a strict Nash network but also switch to several other strict Nash networks and stay with each of them fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and General
سال: 2000
ISSN: 0305-4470,1361-6447
DOI: 10.1088/0305-4470/33/9/305